Diclib.com
Dicionário ChatGPT

Pesquisa de dicionário Soluções personalizadas

Digite uma palavra ou frase em qualquer idioma 👆

Idioma:

Tradução e análise de palavras por inteligência artificial ChatGPT

Nesta página você pode obter uma análise detalhada de uma palavra ou frase, produzida usando a melhor tecnologia de inteligência artificial até o momento:

como a palavra é usada
frequência de uso
é usado com mais frequência na fala oral ou escrita
opções de tradução de palavras
exemplos de uso (várias frases com tradução)
etimologia

O que (quem) é asymptotic minimax - definição

DESCRIPTION OF LIMITING BEHAVIOR OF A FUNCTION

Asymptotic behavior; Asymptotic formula; Asymptotic limit; Asymptotics; Asymptotically equal to; Asymptotic expression; ≃; Asymptotic theory; Asymptotic estimate; Asymptotic equivalence; Asymptotic solution; Asymptotically equal; \sim; ≄; Asymptotic approximation

Minimax theorem

THEOREM PROVIDING CONDITIONS THAT GUARANTEE THAT THE MAX–MIN INEQUALITY IS ALSO AN EQUALITY

Von Neumman's minimax theorem

In the mathematical area of game theory, a minimax theorem is a theorem providing conditions that guarantee that the max–min inequality is also an equality.

https://en.wikipedia.org/wiki/Minimax_theorem

Asymptotic expansion

SERIES WHICH GIVES AN APPROXIMATION TO A FUNCTION AS THE ARGUMENT TENDS TO SOME POINT

Asymptotic series; Asymptotically convergent; Poincaré expansion; Asymptotic scale; Asymptotic expansions; Poincare expansion; Asymptotic growth

In mathematics, an asymptotic expansion, asymptotic series or Poincaré expansion (after Henri Poincaré) is a formal series of functions which has the property that truncating the series after a finite number of terms provides an approximation to a given function as the argument of the function tends towards a particular, often infinite, point. Investigations by revealed that the divergent part of an asymptotic expansion is latently meaningful, i.

https://en.wikipedia.org/wiki/Asymptotic_expansion

Asymptotic computational complexity

IN THEORY OF COMPUTATION

Asymptotic time complexity; Asymptotic space complexity

In computational complexity theory, asymptotic computational complexity is the usage of asymptotic analysis for the estimation of computational complexity of algorithms and computational problems, commonly associated with the usage of the big O notation.

https://en.wikipedia.org/wiki/Asymptotic_computational_complexity

Wikipédia

Asymptotic analysis

In mathematical analysis, asymptotic analysis, also known as asymptotics, is a method of describing limiting behavior.

As an illustration, suppose that we are interested in the properties of a function f (n) as n becomes very large. If f(n) = n² + 3n, then as n becomes very large, the term 3n becomes insignificant compared to n². The function f(n) is said to be "asymptotically equivalent to n², as n → ∞". This is often written symbolically as f (n) ~ n², which is read as "f(n) is asymptotic to n²".

An example of an important asymptotic result is the prime number theorem. Let π(x) denote the prime-counting function (which is not directly related to the constant pi), i.e. π(x) is the number of prime numbers that are less than or equal to x. Then the theorem states that

Asymptotic analysis is commonly used in computer science as part of the analysis of algorithms and is often expressed there in terms of big O notation.

https://en.wikipedia.org/wiki/Asymptotic analysis